RustBelt meets relaxed memory
نویسندگان
چکیده
منابع مشابه
Software Transactional Memory on Relaxed Memory Models
Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptions are often violated in realistic settings, as STM implementations run on relaxed memory models, with the atomicity of operations as provided by the hardware. This paper presents the first approach to verify STMs under relaxed...
متن کاملModeling Relaxed Memory Consistency Protocols
This paper presents a modeling approach based on deterministic and stochastic Petri nets (DSPN's) for analyzing memory consistency protocols for multiprocessors with Distributed Shared Memory (DSM). DSPN's are a numerically solvable modeling formalism with a graphical representation. The modeling approach addresses in particular the performance degradation due to the amount of message exchange,...
متن کاملVerifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory programs this task is challenging because (1) concurrent threads can observe transformations that would be undetectable in a sequential program, and (2) contemporary multiprocessors commonly use relaxed memory models that ...
متن کاملVerification of Software under Relaxed Memory
Leonardsson, C. 2016. Verification of Software under Relaxed Memory. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1387. 102 pp. Uppsala: Acta Universitatis Upsaliensis. ISBN 978-91-554-9616-6. The work covered in this thesis concerns automatic analysis of correctness of parallel programs running under relaxed memory models. When a parallel ...
متن کاملCompositional Verification of Relaxed-Memory Program Transformations
is paper is about verifying program transformations on an axiomatic relaxed memory model of the kind used in C/C++ and Java. Relaxed models present particular challenges for verifying program transformations, because they generate many additional modes of interaction between code and context. For a block of code being transformed, we dene a denotation from its behaviour in a set of representa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2020
ISSN: 2475-1421
DOI: 10.1145/3371102